Analyzing Innermost Runtime Complexity Through Tuple Interpretations

نویسندگان

چکیده

Time complexity in rewriting is naturally understood as the number of steps needed to reduce terms normal forms. Establishing bounds this measure a well-known problem community. A vast majority techniques find such consist modifying termination proofs order recover information. This has been done for instance with semantic interpretations, recursive path orders, and dependency pairs. In paper, we follow same program by tailoring tuple interpretations deal innermost analysis. interpretation interprets tuples holding upper cost reduction size contrast full setting, strongly monotonic requirement components dropped when reductions are innermost. weakened on allows us prove version compatibility result: if all rules term system can be strictly oriented, then rewrite relation well-founded. We establish necessary conditions which guarantee polynomial runtime compatible systems describe search procedure interpretations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing Runtime Complexity via Innermost Runtime Complexity

There exist powerful techniques to infer upper bounds on the innermost runtime complexity of term rewrite systems (TRSs), i.e., on the lengths of rewrite sequences that follow an innermost evaluation strategy. However, the techniques to analyze the (full) runtime complexity of TRSs are substantially weaker. In this paper, we present a sufficient criterion to ensure that the runtime complexity o...

متن کامل

A Analyzing Runtime and Size Complexity of Integer Programs

We present a modular approach to automatic complexity analysis of integer programs. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer bounds on the absolute values of program variables, we can restrict each analysis step to a small part of the program while maintaining a high level of precision. The bounds computed by our method are pol...

متن کامل

Uncurrying for Innermost Termination and Derivational Complexity

First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this transformation behaves for innermost termination and (innermost) derivational complexity. We prove that it reflects innermost termination and ...

متن کامل

Complexity Invariance of Real Interpretations

In the field of implicit computational complexity, we are considering in this paper the fruitful branch of interpretation methods. In this area, the synthesis problem is solved by Tarski’s decision procedure, and consequently interpretations are usually chosen over the reals rather than over the integers. Doing so, one cannot use anymore the (good) properties of the natural (well-) ordering of ...

متن کامل

Multi-Tuple Deletion Propagation: Approximations and Complexity

This paper studies the computational complexity of the classic problem of deletion propagation in a relational database, where tuples are deleted from the base relations in order to realize a desired deletion of tuples from the view. Such an operation may result in a (sometimes unavoidable) side effect: deletion of additional tuples from the view, besides the intentionally deleted ones. The goa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2023

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.376.5